Simplex-type algorithm for optimizing a pseudolinear quadratic fractional function over a polytope
نویسنده
چکیده
Recently Cambini and Carosi described a characterization of pseudolinearity of quadratic fractional functions. A reformulation of their result was given by Rapcsák. Using this reformulation, in this paper we describe an alternative proof of the Cambini–Carosi Theorem. Our proof is shorter than the proof given by Cambini–Carosi and less involved than the proof given by Rapcsák. As an application we present a simplex-type algorithm for optimizing a pseudolinear quadratic fractional function over a polytope. Our algorithm works in a more general setting than the convex simplex algorithm adapted to the above problem.
منابع مشابه
Some Heuristics and Test Problems for Nonconvex Quadratic Programming over a Simplex
In this paper we compare two methods for estimating a global minimizer of an inde nite quadratic form over a simplex The rst method is based on the enumeration of local minimizers of a so called control polytope The second method is based on an approximation of the convex envelope using semide nite programming In order to test the algorithms a method for generating random test problems is prese...
متن کاملClose interval approximation of piecewise quadratic fuzzy numbers for fuzzy fractional program
The fuzzy approach has undergone a profound structural transformation in the past few decades. Numerous studies have been undertaken to explain fuzzy approach for linear and nonlinear programs. While, the findings in earlier studies have been conflicting, recent studies of competitive situations indicate that fractional programming problem has a positive impact on comparative scenario. We pro...
متن کامل- - - - Computational Geometry Bibliography 1 1
Zuni´c. On the maximal number of edges of convex digital polygons included into a square grid. A simplex variant solving an m ×d linear program in O (min(m 2 , d 2)) expected number of pivot steps. A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension. 12 P. K. Agarwal. A deterministic algorithm for partitioning arrangements of lin...
متن کاملAn iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach
Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of pro...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006